ISSN 1342-2804 User Manual for SparsePOP: a Sparse Semidefinite Programming Relaxation of Ppolynomial Optimization Problems
نویسندگان
چکیده
SparesPOP is a MATLAB implementation of a sparse semidefinite programming (SDP) relaxation method for approximating a global optimal solution of a polynomial optimization problem (POP) proposed by Waki et al. The sparse SDP relaxation exploits a sparse structure of polynomials in POPs when applying “a hierarchy of LMI relaxations of increasing dimensions” by Lasserre. The efficiency of SparsePOP to approximate optimal solutions of POPs is thus increased, and larger scale POPs can be handled. The software package SparesPOP, this manual, and a test set of POPs from the literature are available at http://www.is.titech.ac.jp/∼kojima/SparsePOP.
منابع مشابه
ISSN 1342-2804 User Manual for SFSDP: a Sparse versions of Full SemiDefinite Programming Relaxation for Sensor Network Localization Problems
SFSDP is a Matlab package for solving sensor network localization problems. The package contains four functions, SFSDP.m, SFSDPplus.m, generateProblem.m, test SFSDP.m, and some numerical examples. The function SFSDP.m is an Matlab implementation of the semidefinite programming (SDP) relaxation proposed in the recent paper by Kim, Kojima and Waki for sensor network localization problems, as a sp...
متن کاملSparsePOP: a Sparse Semidefinite Programming Relaxation of Polynomial Optimization Problems
SparesPOP is a MATLAB implementation of a sparse semidefinite programming (SDP) relaxation method proposed for polynomial optimization problems (POPs) in the recent paper by Waki et al. The sparse SDP relaxation is based on “a hierarchy of LMI relaxations of increasing dimensions” by Lasserre, and exploits a sparsity structure of polynomials in POPs. The efficiency of SparsePOP to compute bound...
متن کاملISSN 1342-2804 Invariance under Affine Transformation in Semidefinite Programming Relaxation for Polynomial Optimization Problems
Given a polynomial optimization problem (POP), any affine transformation on its variable vector induces an equivalent POP. Applying Lasserre's SDP relaxation to the original and the transformed POPs, we have two SDPs. This paper shows that these two SDPs are isomorphic to each other under a nonsingular linear transformation, which maps the feasible region of one SDP onto that of the other isomo...
متن کاملB : Operations Research ISSN 1342 - 2804 Solutions of Polynomial Systems Derived from the Steady Cavity Flow Problem
We propose a general algorithm to enumerate all solutions of a zero-dimensional polynomial system with respect to a given cost function. The algorithm is developed and is used to study a polynomial system obtained by discretizing the steady cavity flow problem in two dimensions. The key technique on which our algorithm is based is to solve polynomial optimization problems via sparse semidefinit...
متن کامل1342 - 2804 A Continuation Method for Large - sized Sensor Network Localization Problems
The solution methods based on semidefinite programming (SDP) relaxations for sensor network localization (SNL) problems can not handle very large-sized SNL problems. We present a continuation method using the gradient descent method to efficiently solve large-sized SNL problems. We first formulate the problem as an unconstrained optimization problem and then apply the continuation on the distan...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005